Testing Finite-State Machines: State Identification and Verification
نویسندگان
چکیده
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملAbstract State Machines: Verification Problems and Complexity Dissertation
State Machines: Verification Problems and Complexity
متن کاملA Formal Testing Framework for UML Statechart Diagrams Behaviours: From Theory to Automatic Verification
In this paper we propose a formal testing framework for a behavioural subset of UML Statechart Diagrams (UMLSDs). A new formal operational semantics is defined, which uses the same core semantics introduced in previous work of ours but which is better suited for testing theory. The new semantics is proved consistent with our original one and is guaranteed to generate only finite state machines....
متن کاملDecision problems for interacting finite state machines
Given a system of n interacting finite state machines (FSM’s) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. We investigate the complexity of this decision problem and three of its derivatives, namely l) verifying system determinism, 2) testing for the existence of unspecified inputs to any FSM within the system, and ...
متن کاملPartial Unfolding for Compositional Nonblocking Verification of Extended Finite-state Machines
This working paper describes a framework for compositional nonblocking verification of reactive systems modelled as extended finite-state machines. The nonblocking property can capture the absence of livelocks and deadlocks in concurrent systems. Compositional verification is shown in previous work to be effective to verify this property for large discrete event systems. Here, these results are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 43 شماره
صفحات -
تاریخ انتشار 1994